Models and methods for frequency assignment with cumulative interference constraints

نویسندگان

  • Mireille Palpant
  • Cristian Oliva
  • Christian Artigues
  • Philippe Michelon
  • Mohamed Didi Biha
چکیده

In this paper, a realistic modeling of interferences for frequency assignment in hertzian telecommunication networks is presented. In contrast with traditional interference models based only on binary interference constraints involving two frequencies, this new approach considers the case of cumulative disruptions that are modeled through a unique non-binary constraint. To deal with these complex constraints, we propose extensions of classical integer linear programming formulations. On a set of realistic instances, we propose hybrid constraint programming and large neighborhood search solution methods to solve minimum interference and minimum span frequency assignment problems. We compare their performances with those of existing heuristics. Finally, we show how the end-user benefits from using the cumulative model instead of the traditional one.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Allocation de fréquence dans les systèmes de communication par satellites de type SDMA

In this thesis, we consider frequency assignment problems arising from an SDMA satellite communication system which consists of a satellite and a number of users distributed inside a fixed sized service area. The objective is to assign a given number of frequency carriers to as many users as possible. This assignment should not violate the incurred interference constraints. Two types of interfe...

متن کامل

Models and methods for frequency allocation with cumulative interference constraints

We consider a realistic modelling of interferences for frequency allocation in hertzian telecommunication networks. In contrast with traditional interference models based only on binary interference constraints, this new approach considers the case of a receiver disrupted simultaneously by several senders yielding cumulative disruptions that are modelled through a unique non-binary constraint. ...

متن کامل

Solving Frequency Assignment Problems via Tree-Decomposition

In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition. We show that with the use of several dominance and bounding techniques it is possible to solve small and medium...

متن کامل

Optimal Solutions for Frequency Assignment Problems via Tree Decomposition

In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition. With the use of several dominance and bounding techniques it is possible to solve small and medium-sized real-l...

متن کامل

Joint Closed-Loop Power Control and Base Station Assignment for DS-CDMA Receiver in Multipath Fading Channel with Adaptive Beamforming Method

In this paper, we propose smart step closed-loop power control (SSPC) algorithm and base station assignment based on minimizing the transmitter power (BSAMTP) technique in a direct sequence-code division multiple access (DS-CDMA) receiver in the presence of frequency-selective Rayleigh fading. This receiver consists of three stages. In the first stage, with conjugate gradient (CG) adaptive ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ITOR

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2008